DARP: Divide Areas Algorithm for Optimal Multi-Robot Coverage Path Planning
نویسندگان
چکیده
منابع مشابه
DARP: Divide Areas Algorithm for Optimal Multi-Robot Coverage Path Planning
This paper deals with the path planning problem of a team of mobile robots, in order to cover an area of interest, with prior-defined obstacles. For the single robot case, also known as single robot coverage path planning (CPP), an O(n) optimal methodology has already been proposed and evaluated in the literature, where n is the grid size. The majority of existing algorithms for the multi robot...
متن کاملMulti-Robot Path Planning for Selective Coverage
In this paper we propose a reward-driven finitehorizon model akin to a Markov Decision Process to extract the maximum amount of valuable data in least amount of time. We present a path planning algorithm that generates off-line trajectories for multiple robots to cover a region of interest by visiting the hot-spots in increasing order of their significance. An underlying distribution is assumed...
متن کاملDiscrete Path Planning Strategies for Coverage and Multi-robot Rendezvous
This thesis addresses the problem of motion planning for autonomous robots, given a map and an estimate of the robot pose within it. The motion planning problem for a mobile robot can be defined as computing a trajectory in an environment from one pose to another while avoiding obstacles and optimizing some objective such as path length or travel time, subject to constraints like vehicle dynami...
متن کاملOptimal Path Planning for Mobile Robot Using Tailored Genetic Algorithm
During routine inspecting, mobile robot may be requested to visit multiple locations to execute special tasks occasionally. This study aims at optimal path planning for multiple goals visiting task based on tailored genetic algorithm. The proposed algorithm will generate an optimal path that has the least idle time, which is proven to be effective on evaluating a path in our previous work. In p...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Intelligent & Robotic Systems
سال: 2017
ISSN: 0921-0296,1573-0409
DOI: 10.1007/s10846-016-0461-x